A Reconfigurable TDMP Decoder for Raptor Codes
نویسندگان
چکیده
A Raptor code is a concatenation of a fixed rate precode and a Luby-Transform (LT) code that can be used as a rateless error-correcting code over communication channels. By definition, Raptor codes are characterized by irregularity features such as dynamic rate, check-degree variability, and joint coding, which make the design of hardware-efficient decoders a challenging task. In this paper, serial turbo decoding of architecture-aware Raptor codes is mapped into sequential row processing of a regular matrix by using a combination of code enhancements and architectural optimizations. The proposed mapping approach is based on three basic steps: (1) applying systematic permutations on the source matrix of the Raptor code, (2) confining LT random encoding to pseudo-random permutation of messages and periodic selection of rowsplitting scenarios, and (3) developing a reconfigurable parallel check-node processor that attains a constant throughput while processing LTand LDPC-nodes of varying degrees and count. The decoder scheduling is, thus, made simple and uniform across both LDPC and LT decoding. A serial decoder implementing the proposed approach was synthesized in 65 nm, 1.2 V CMOS technology. Hardware simulations show that the decoder, decoding a rate-0.4 code instance, achieves a throughput of 36 Mb/s at SNR of 1.5 dB, dissipates an average power of 27 mW and occupies an area of 0.55 mm2. H. Zeineddine · M. M. Mansour (B) American University of Beirut, Beirut, Lebanon e-mail: [email protected] H. Zeineddine e-mail: [email protected]
منابع مشابه
Memory-efficient Turbo Decoder Architectures for Ldpc Codes
In this paper, we propose a turbo decoding messagepassing (TDMP) algorithm to decode regular and irregular lowdensity parity-check (LDPC) codes. The TDMP algorithm has two main advantages over the commonly employed two-phase messagepassing algorithm. First, it exhibits a faster convergence behavior (up to 50% less iterations), and improvement in coding gain (up to an order of magnitude for mode...
متن کاملAnalyse asymptotique et conception robuste de codes Raptor pour le décodage conjoint
In this paper, we consider the joint decoding of Raptor codes on a binary input additive white Gaussian noise channel. Raptor codes are rateless fountain codes that have the attractive property of being universal on the binary erasure channel: they can approach arbitrarily close the capacity, independently of the channel parameter. It has been recently shown that Raptor codes are not universal ...
متن کاملJoint Channel Estimation and Decoding of Raptor Code on Fading Channel
In this paper, the problem of transmission of Raptor codes over fading channel is considered. We present in this paper joint decoder architecture for Raptor codes over phase coherent fading channel. The proposed scheme does not require transmission of pilot symbols or extra coded bits for achieving the same BER performance. The receiver uses sum-product algorithm to jointly estimate the channel...
متن کاملLuby Transform Codes with Priority Encoding
Rateless codes over a binary erasure channel (BEC) provide successful transmission independent of the erasure probability. Luby Transform (LT) codes and raptor codes are examples of rateless codes over a BEC. For successful decoding, LT codes require either a large overhead at linear complexity, or capacity-approaching overheads with nonlinear complexity. When overhead is low at linear complexi...
متن کاملHardware Accelerator for Raptor Decoder
Hard Raptor Codes (designed for erasure channels) are widely used for mobile multimedia content delivery, and yet they have not been investigated in the context of embedded systems where the energy dissipation is as important as the timing performance. The most time consuming part of Raptor decoder is the matrix inversion operation. This paper proposes a hardware accelerator, for two matrix inv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Signal Processing Systems
دوره 69 شماره
صفحات -
تاریخ انتشار 2012